Parallel chaos optimization algorithm with migration and merging operation

Chaos optimization algorithm (COA) utilizes the chaotic maps to generate the pseudo-random sequences mapped as the decision variables for global optimization applications. A kind of parallel chaos optimization algorithm (PCOA) has been proposed in our former studies to improve COA. The salient feature of PCOA lies in its pseudo-parallel mechanism. However, all individuals in the PCOA search independently without utilizing the fitness and diversity information of the population. In view of the limitation of PCOA, a novel PCOA with migration and merging operation (denoted as MMO-PCOA) is proposed in this paper. Specifically, parallel individuals are randomly selected to be conducted migration and merging operation with the so far parallel solutions. Both migration and merging operation exchange information within population and produce new candidate individuals, which are different from those generated by stochastic chaotic sequences. Consequently, a good balance between exploration and exploitation can be achieved in the MMO-PCOA. The impacts of different one-dimensional maps and parallel numbers on the MMO-PCOA are also discussed. Benchmark functions and parameter identification problems are used to test the performance of the MMO-PCOA. Simulation results, compared with other optimization algorithms, show the superiority of the proposed MMO-PCOA algorithm.     

Weighted Superposition Attraction (WSA): A swarm intelligence algorithm for optimization problems – Part 2: Constrained optimization

This paper is the second one of the two papers entitled “Weighted Superposition Attraction (WSA) Algorithm”, which is about the performance evaluation of the WSA algorithm in solving the constrained global optimization problems. For this purpose, the well-known mechanical design optimization problems, design of a tension/compression coil spring, design of a pressure vessel, design of a welded beam and design of a speed reducer, are selected as test problems. Since all these problems were formulated as constrained global optimization problems, WSA algorithm requires a constraint handling method for tackling them. For this purpose we have selected 6 formerly developed constraint handling methods for adapting into WSA algorithm and analyze the effect of the used constraint handling method on the performance of the WSA algorithm. In other words, we have the aim of producing concluding remarks over the performance and robustness of the WSA algorithm through a set of computational study in solving the constrained global optimization problems. Computational study indicates the robustness and the effectiveness of the WSA in terms of obtained results, reached level of convergence and the capability of coping with the problems of premature convergence, trapping in a local optima and stagnation.     

Multiobjective PSO based adaption of neural network topology for pixel classification in satellite imagery

The proposed work involves the multiobjective PSO based adaption of optimal neural network topology for the classification of multispectral satellite images. It is per pixel supervised classification using spectral bands (original feature space). This paper also presents a thorough experimental analysis to investigate the behavior of neural network classifier for given problem. Based on 1050 number of experiments, we conclude that following two critical issues needs to be addressed: (1) selection of most discriminative spectral bands and (2) determination of optimal number of nodes in hidden layer. We propose new methodology based on multiobjective particle swarm optimization (MOPSO) technique to determine discriminative spectral bands and the number of hidden layer node simultaneously. The accuracy with neural network structure thus obtained is compared with that of traditional classifiers like MLC and Euclidean classifier. The performance of proposed classifier is evaluated quantitatively using Xie-Beni and β indexes. The result shows the superiority of the proposed method to the conventional one.     

An optimization model for evaluating the economic impact of availability and maintenance notions during the synthesis and design of a power plant

In this paper, we introduce an optimization strategy in order to comprehensively quantify the impact of availability and maintenance notions during the early stages of synthesis and design of a new natural gas combined cycle power plant. A detailed state-space approach is thoroughly discussed, where influence of maintenance funds on each component's repair rate is directly assessed.In this context, analysis of the reliability characteristics of the system is centered at two designer-adopted parameters, which largely influence the obtained results: the number of components which may fail independently at the same time, and the number of simultaneous failure/repair events.Then, optimal solutions are evaluated as the availability-related parameters and the amount of resources assigned for maintenance actions are varied across a wide range of feasible values, which enable obtaining more accurate and detailed estimations of the expected economic performance for the project when compared with traditional economic evaluation approaches.     

CO压缩机优化运行总结

为确保原CO压缩机在净化系统升级改造项目实施后能安全稳定运行,采取了流程优化、工艺条件论证、设备缺陷排查、联锁指标重新确定等一系列措施。改造措施实施后,CO压缩机出口压力稳定在3.23 MPa左右,有效缓解了前后工序压力波动对压缩机稳定运行的影响,各级水冷却器的换热效果也得到了较大的改善。     

红岭矿18线南西翼通风系统技术改造

针对矿山18线南西翼矿体开采过程中存在的通风系统不完善、风量欠缺、污风无法及时排出等问题，运用风压平衡原理、网络优化技术、机站优化技术以及计算机网络模拟技术展开研究，拟定了3种可行的通风方案。经技术经济比较，确定了新掘18线905～855 m回风井（1.5 m），保留该井905 m 水平回风机站，并在855 m 水平新设1台K45 6 №12风机（18.5 kW）方案。数值模拟结果表明：18线南西翼通风系统总风量达到20.5 m3/s，井下风流的可调性和稳定性增强，为矿山的安全生产提供了有力保障。     

A new decomposition based evolutionary algorithm with uniform designs for many-objective optimization

For many-objective optimization problems, how to get a set of solutions with good convergence and diversity is a difficult and challenging work. In this paper, a new decomposition based evolutionary algorithm with uniform designs is proposed to achieve the goal. The proposed algorithm adopts the uniform design method to set the weight vectors which are uniformly distributed over the design space, and the size of the weight vectors neither increases nonlinearly with the number of objectives nor considers a formulaic setting. A crossover operator based on the uniform design method is constructed to enhance the search capacity of the proposed algorithm. Moreover, in order to improve the convergence performance of the algorithm, a sub-population strategy is used to optimize each sub-problem. Comparing with some efficient state-of-the-art algorithms, e.g., NSGAII-CE, MOEA/D and HypE, on six benchmark functions, the proposed algorithm is able to find a set of solutions with better diversity and convergence.     

Global optimization for power dispatch problems based on theory of moments

Non-convex of an optimal power dispatch problem makes it difficult to guarantee the global optimum. This paper presents a convex relaxation approach, called the Moment Semidefinite Programming (MSDP) method, to facilitate the search for deterministic global optimal solutions. The method employs a sequence of moments, which can linearize polynomial functions and construct positive semidefinite moment matrices, to form an SDP convex relaxation for power dispatch problems. In particular, the rank of the moment matrix is used as a sufficient condition to ensure the global optimality. The same condition can also be leveraged to estimate the number of global optimal solution(s). This method is effectively applied to {0,1}-economic dispatch (ED) problems and optimal power flow (OPF) problems. Simulation results showed that the MSDP method is capable of solving {0,1}-ED problems with integer values directly, and is able to identify if more than one global optimal solutions exist. In additional, the method can obtain rank-1 moment matrices for OPF’s counterexamples of existing SDP method, this ensures the global solution and overcomes the problem that existing SDP method cannot meet the rank-1 condition sometimes.     

Kariya (Hildegardia barteri) seed oil extraction: comparative evaluation of solvents,modeling, and optimization techniques

In this work, the effects of solid/solvent ratio (0.10–0.25?g/ml), extraction time (3–8?h), and solvent type (n-hexane, ethyl acetate, and acetone) together with their shared interactions on Kariya seed oil (KSO) yield were investigated. The oil extraction process was modeled via response surface methodology (RSM), artificial neural network (ANN) and adaptive neuro-fuzzy inference system (ANFIS) while the optimization of the three input variables essential to the oil extraction process was carried out by genetic algorithm (GA) and RSM methods. The low mean relative percent deviation (MRPD) of 0.94–4.69% and high coefficient of determination (R²) > 0.98 for the models developed demonstrate that they describe the solvent extraction process with high accuracy in this order: ANFIS, ANN, and RSM. The best operating condition (solid/solvent ratio of 0.1?g/ml, extraction time of 8?h, and acetone as solvent of extraction) that gave the highest KSO yield (32.52?wt.%) was obtained using GA-ANFIS and GA-ANN. Solvent extraction efficiency evaluation showed that ethyl acetate, n-hexane, and acetone gave maximum experimental oil yields of 19.20?±?0.28, 25.11?±?0.01, and 32.33?±?0.04?wt.%, respectively. Properties of the KSO varied based on the type of solvent used. The results of this work showed that KSO could function as raw material in both food and chemical industries.     

A new metaheuristic for optimization: Optics inspired optimization (OIO)

Due to the law of reflection, a concave reflecting surface/mirror causes the incident light rays to converge and a convex surface/mirror causes the light rays to reflect away so that they all appear to be diverging. These converging and diverging behaviors cause that the curved mirrors show different image types depending on the distance between the object and the mirror. We model such optical phenomena metaphorically into the searching process of numerical optimization by a new algorithm called optics inspired optimization (OIO). OIO treats the surface of the numerical function to be optimized as a reflecting surface in which each peak is assumed to reflect as a convex mirror and each valley to reflect as a concave one. Each individual is assumed to be an artificial object (or light point) that its artificially glittered ray is reflected back by the function surface, given that the surface is convex or concave, and the artificial image is formed (a candidate solution is generated within the search domain) based on the mirror equations adopted from physics of optics. Besides OIO, we introduce different variants of it, called ROIO (Rotation based OIO), and COIO (Convex combination based OIO) algorithms and conduct an extensive computational effort to find out the merit of the new algorithms. Our comparisons on benchmark test functions and a real world engineering design application (i.e., optimization of a centrifuge pump) demonstrate that the new algorithms are efficient and compete better than or similar to most of state of the art optimization algorithms with the advantage of accepting few input parameters.